Directly-Executable Earley Parsing
نویسندگان
چکیده
Deterministic parsing techniques are typically used in favor of general parsing algorithms for efficiency reasons. However, general algorithms such as Earley’s method are more powerful and also easier for developers to use, because no seemingly arbitrary restrictions are placed on the grammar. We describe how to narrow the performance gap between general and deterministic parsers, constructing a directlyexecutable Earley parser that can reach speeds comparable to deterministic methods even on grammars for commonly-used programming languages.
منابع مشابه
Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs
My research goal is to employ a parser generation algorithm based on the Earley parsing algorithm to the evaluation and compilation of queries to logic programs, especially to deductive databases. By means of partial deduction, from a query to a logic program a parameterized automaton is to be generated that models the evaluation of this query. This automaton can be compiled to executable code;...
متن کاملDirect Parsing With Metarules
In this paper we argue for the direct application of metarules in the parsing process and introduce a slight restriction on metarules. This restriction relies on theoretical results about the termination of term-rewrite systems and does not reduce the expressive power of metarules as much as previous restrictions. We prove the termination for a set of metarules used in our German grammar and sh...
متن کاملEarley Deduction
This paper first reviews Earley Deduction, a generalization of the Earley Parsing Algorithm to the execution of Horn Clause Logic Programs. Earley Deduction is both sound and—unlike the standard Prolog interpreter—complete; proofs of this are included. For functor-free programs, the method is also guaranteed to terminate. (The functor-free subset of Prolog is called DATALOG and can be used to c...
متن کاملSimple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle
Parsers for context-free grammars can be implemented directly and naturally in a functional style known as “combinator parsing”, using recursion following the structure of the grammar rules. Traditionally parser combinators have struggled to handle all features of context-free grammars, such as left recursion. Previous work introduced novel parser combinators that could be used to parse all con...
متن کاملMemoization of Top Down Parsing
In a paper published in this journal, Norvig (1991) pointed out that memoization of a topdown recognizer program produces a program that behaves similiarly to a chart parser. This is not surprising to anyone familiar with logic-programming approaches to NLP. For example, the Earley deduction proof procedure is essentially a memoizing version of the top-down SLD proof procedure employed by Prolo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001